Probe Machine Based Computing Model for Maximum Clique Problem

Probe machine (PM) is a recently reported mathematic model with massive parallelism. Herein, we presented searching the maximum clique of an undirected graph six vertices. We constructed data library containing n sublibraries, each sublibrary corresponded to vertex in given graph. Then, probe according induced subgraph was designed order search and generate all maximal cliques. Subsequently, performed operation, cliques were generated parallel. The advantages proposed lie two aspects. On one hand, solution NP-complete problem just step operation rather than found vast space. other highly work demonstrates that PM superior TM terms capacity when tackling problem.